Planning Simulation Run Length for Queueing Systems
نویسندگان
چکیده
Simulation of large scale networks can be very time and resource-consuming. It is hard to predict when the amount of data collected from a simulation is enough and the measurement is accurate enough for the parameter of interest. In this paper, we study the planning of simulation run length, and investigate how many cycles of overflow / non-overflow are needed for the packet loss probability to reach steady state. The limiting distribution of a two-state Markov Chain is applied to this steady state analysis of predicting the required time. An analytical model is developed for the smallest number of cycles required, with regards to the predetermined level of accuracy required. This number gives a guide as to how long the simulation should be run, i.e. when the measurement is accurate enough and the simulation can be stopped.
منابع مشابه
Capacity planning in the hospital queueing network with blocking: simulation-based optimization approach
Introduction: Hospital administrators have always faced the challenge of providing the best possible health services in a resource-limited environment. The patient flow throughout the hospital is affected by lack of the capacities that can lead to bed-blocking among the hospital units. In this research, the patient flow in the hospital is modeled as an open queueing network with blocking. Then,...
متن کاملA capacity planning model of unreliable multimedia service systems
To analyze the performance of multimedia service systems, which have unreliable resources, and to estimate the capacity requirement of the systems, we have developed a capacity planning model using an open queueing network. By acquisition of utilization, queue length of the resources and packet delay, and reliability of the systems, we have derived the service capacity of the systems along with...
متن کاملAn Approximate Analysis of Two Class WFQ Systems
The class based weighted fair queueing (WFQ) is applied in a lot of computer and communication systems. It is a popular way to share a common resource. Its efficient analytical solution is an open question for a long time. Different solutions were proposed, using complex analysis or numerical techniques. But all of these methods have their limits in usability. In this paper we present a very si...
متن کاملMultiple vacation policy for MX/Hk/1 queue with un-reliable server
This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کامل